Cascade Algorithm Revisited

نویسندگان

  • Tadao Takaoka
  • Kiyomi Umehara
چکیده

We revisit the cascade algorithm for the all pairs shortest path (APSP) problem. The operation on the distace data is limited to the triple operation of min{a, b + c}. The best known complexity on this model is n by Floyd’s algorithm. The cascade algorithm takes 2n opearations. We first improve this bound to n, that is, on a par with Floyd’s algorithm. Then we implement the improved version on a mesh computer and achieve 3n− 2 communication steps.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sweep Line Algorithm for Convex Hull Revisited

Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...

متن کامل

Box splines revisited: Convergence and acceleration methods for the subdivision and the cascade algorithms

A general convergence analysis of the cascade algorithm, for the determination of a refinable function from its mask, is applied to box splines in which case certain difficulties adherent to the general case can be resolved completely and even elegantly. In the process, the understanding of the convergence of the adjoint process, subdivision, is also enhanced.

متن کامل

QUICKSELECT Revisited

We give an overview of the running time analysis of the random divide-and-conquer algorithm FIND or QUICKSELECT. The results concern moments, distribution of FIND’s running time, the limiting distribution, a stochastic bound and the key: a stochastic fixed point equation.

متن کامل

الگوریتم مستطیل آبشاری و ماتریس انتقال در شبکه های کوتاه ترین مسیر بادور

Shortest path problem is among the most interesting problems in the field of graph and network theory. There are many efficient matrix based algorithms for detecting of shortest path and distance between all pairs of this problem in literature. In this paper, a new exact algorithm, named Cascade Rectangle Algorithm, is presented by using main structure of previous exact algorithms and developin...

متن کامل

Optimization of cascade hydropower system operation by genetic algorithm to maximize clean energy output

Background: Several reservoir systems have been constructed for hydropower generation around the world. Hydropower offers an economical source of electricity with reduce carbon emissions. Therefore, it is such a clean and renewable source of energy. Reservoirs that generate hydropower are typically operated with the goal of maximizing energy revenue. Yet, reservoir systems are inefficiently ope...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014